- connected vertices vertex
- Математика: связанные вершины (графа)
Универсальный англо-русский словарь. Академик.ру. 2011.
connected vertices vertex
Смотреть что такое "connected vertices vertex" в других словарях:
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … Wikipedia
Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… … Wikipedia
Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic … Wikipedia
Vertex figure — In geometry a vertex figure is, broadly speaking, the figure exposed when a corner of a polyhedron or polytope is sliced off. Definitions theme and variationsTake some vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw … Wikipedia
Vertex model — A vertex model is a type of statistical mechanics model in which the Boltzmann weights are associated with a vertex in the model (representing an atom or particle). This contrasts with a nearest neighbour model, such as the Ising model, in which… … Wikipedia
Vertex arrangement — See vertex figure for the local description of faces around a vertex of a polyhedron or tiling. In geometry, a vertex arrangement is a set of points in space described by their relative positions. They can be described by their use in… … Wikipedia
Vertex separator — In graph theory, a subset S subset V is a vertex separator for nonadjacent vertices a and b if the removal of S from the graph separates a and b into distinct connected components … Wikipedia
Cut vertex — In mathematics and computer science, a cut vertex or articulation point is a vertex of a graph such that removal of the vertex causes an increase in the number of connected components. If the graph was connected before the removal of the vertex,… … Wikipedia
K-vertex-connected graph — In graph theory, a graph G with vertex set V(G) is said to be k vertex connected (or k connected) if G setminus X is connected for all X subseteq V(G) with left| X ight| < k. In plain English, a graph is k connected if the graph remains connected … Wikipedia
Doubly connected edge list — The doubly connected edge list (DCEL) is a data structure to represent an embedding of a planar graph in the plane and polytopes in 3D. This data structure provides efficient manipulation of the topological information associated with the objects … Wikipedia
Cube-connected cycles — The cube connected cycles of order 3, arranged geometrically on the vertices of a truncated cube. In graph theory, the cube connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was… … Wikipedia
